Reachability matrices and cyclic matrices
نویسندگان
چکیده
منابع مشابه
Ela Reachability Matrices and Cyclic Matrices
Received by the editors September 23, 2009. Accepted for publication February 11, 2010. Handling Editor: Daniel Szyld. Dipartimento di Ingegneria dell’Informazione, Università di Padova, I-35131 Padova, Italy ([email protected]). Mathematisches Institut, Universität Würzburg, D-97074 Würzburg, Germany ([email protected]). Electronic Journal of Linear Algebra ISSN 1081-3810 A...
متن کاملVector Reachability Problem in SL(2, Z)
This paper solves two open problems about the decidability of the vector reachability problem over a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from SL(2,Z). The approach to solving reachability problems is based on the characterization of reachability path...
متن کاملUndecidability Bounds for Integer Matrices Using Claus Instances
There are several known undecidability problems for 3×3 integer matrices the proof of which uses a reduction from the Post Correspondence Problem (PCP). We establish new lower bounds in the numbers of matrices for the mortality, zero in left upper corner, vector reachability, matrix reachability, scaler reachability and freeness problems. Also, we give a short proof for a strengthened result du...
متن کاملReachability Problems for Products of Matrices in Semirings
We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multi...
متن کاملScalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
There has been much research into freeness properties of finitely generated matrix semigroups under various constraints, mainly related to the dimensions of the generator matrices and the semiring over which the matrices are defined. A recent paper has also investigated freeness properties of matrices within a bounded language of matrices, which are of the form M1M2 · · ·Mk ⊆ Fn×n for some semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017